Circuit Complexity Publications

Publications in Circuit Complexity

Explore the most influential research papers and scholarly works that have shaped Circuit Complexity. Use the concept filter below to focus on a specific sub-area of research.

Circuit Complexity

4.5K

Publications

227.2K

Citations

Showing yearly statistics from 2000-2026.

Page 1

	Year	Citations
Graph-Based Algorithms for Boolean Function Manipulation Bryant IEEE Transactions on Computers Circuit ComplexityComputational LogicLogic SynthesisEngineeringBoolean Function Manipulation	1986	8.8K
Completeness theorems for non-cryptographic fault-tolerant distributed computation Michael Ben-Or, Avi Wigderson Circuit ComplexityComputational Complexity TheoryN ProcessorsEngineeringDistributed Algorithms	1988	2.5K
Combinational profiles of sequential benchmark circuits F. Brglez, D. Bryan, Krzysztof Koźmiński Circuit ComplexityEngineeringComputer ArchitectureComputational ComplexityHardware Systems	2003	2.1K
(Leveled) Fully Homomorphic Encryption without Bootstrapping Zvika Brakerski, Craig Gentry, Vinod Vaikuntanathan ACM Transactions on Computation Theory Circuit ComplexityTheory Of ComputingCryptographic PrimitiveLeveled Fhe SchemeEngineering	2014	1.3K
Minimization of Boolean Functions* E.J. McCluskey Bell System Technical Journal Circuit ComplexityMathematical ProgrammingLogic SynthesisSystematic ProcedureEngineering	1956	1.2K
An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic Circuits  Goel IEEE Transactions on Computers Circuit ComplexityImplicit Enumeration ApproachEngineeringVerificationFormal Verification	1981	1.1K
A symbolic analysis of relay and switching circuits Claude E. Shannon Transactions of the American Institute of Electrical Engineers Circuit ComplexitySymbolic ManipulationEngineeringGraph TheoryFormal Methods	1938	1K
A method for synthesizing sequential circuits George H. Mealy Bell System Technical Journal Circuit ComplexityLogic SynthesisEngineeringCircuit DesignComputer Engineering	1955	1K
Parity, circuits, and the polynomial-time hierarchy Merrick L. Furst, James B. Saxe, Michael Sipser Theory of Computing Systems Circuit ComplexityComputational Complexity TheoryEngineeringPolynomial-time HierarchyFormal Methods	1984	930
Dynamic variable ordering for ordered binary decision diagrams Richard Rudell International Conference on Computer Aided Design Mathematical ProgrammingCircuit ComplexityEngineeringComputer ArchitectureComputational Complexity	1993	836
Finding All the Elementary Circuits of a Directed Graph D. Barton Johnson SIAM Journal on Computing Circuit ComplexityDirected GraphEngineeringGraph AlgorithmsGraph Theory	1975	808
The Synthesis of Two-Terminal Switching Circuits Claude E. Shannon Bell System Technical Journal Circuit ComplexityInverse ProblemElectrical EngineeringLogic SynthesisEngineering	1949	758

Page 1